Computing individual Kazhdan–Lusztig basis elements

Computing Heavy Elements

Reliable calculations of the structure of heavy elements are crucial to address fundamental science questions such as the origin of the elements in the universe. Applications relevant for energy production, medicine, or national security also rely on theoretical predictions of basic properties of atomic nuclei. Heavy elements are best described within the nuclear density functional theory (DFT)...

Elements of distributed computing

Mapping Hidden Potential Identity Elements by Computing the Average Discriminating Power of Individual tRNA Positions

The recently published discrete mathematical method, extended consensus partition (ECP), identifies nucleotide types at each position that are strictly absent from a given sequence set, while occur in other sets. These are defined as discriminating elements (DEs). In this study using the ECP approach, we mapped potential hidden identity elements that discriminate the 20 different tRNA identitie...

Computing Frequent Elements Using Gossip

We present algorithms for identifying frequently occurring elements in a large distributed data set using gossip. Our algorithms do not rely on any central control, or on an underlying network structure, such as a spanning tree. Instead, nodes repeatedly select a random partner and exchange data with the partner – if this process continues for a (short) period of time, the desired results are c...

Polyhedral Finite Elements Using Harmonic Basis Functions

Finite element simulations in computer graphics are typically based on tetrahedral or hexahedral elements, which enables simple and efficient implementations, but in turn requires complicated remeshing in case of topological changes or adaptive refinement. We propose a flexible finite element method for arbitrary polyhedral elements, thereby effectively avoiding the need for remeshing. Our poly...